package com.hspedu.newData.LCR;
/**
 * @Author: yh
 * @description: 
 * @CreateTime: 2025-05-20 
 * @Version: 1.0
 */

public class LCR126斐波那锲数 {

    public int fib(int n) {
        if (n<2) return n;
        int[] dp = new int[n+1];
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = (dp[i-2] + dp[i-1])%1000000007;
        }
        return dp[n];

    }

}
